Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q)

نویسندگان

  • Kechao Huang
  • David G. M. Mitchell
  • Lai Wei
  • Xiao Ma
  • Daniel J. Costello
چکیده

In this paper, we compare the finite-length performance of protograph-based spatially coupled lowdensity parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one when the constraint length of q-ary SC-LDPC codes is equal to the block length of q-ary LDPCBCs and the other when the two decoding latencies are equal. Simulation results confirm that, in both regimes, (3, 6)-, (3, 9)-, and (3, 12)-regular non-binary SC-LDPC codes can significantly outperform both binary and non-binary LDPC-BCs and binary SC-LDPC codes. Finally, we present a computational complexity comparison of q-ary SC-LDPC codes and q-ary LDPC-BCs under equal decoding latency and equal decoding performance assumptions. This work was partially supported by the Joint Ph.D. Fellowship Program of the China Scholarship Council, the 973 Program (No. 2012CB316100), the China NSF (No. 61172082), and the U.S. NSF (No. CCF-1161754). This work was performed while K. Huang was visiting the University of Notre Dame. The material in this paper was presented in part at the Information Theory and Applications Workshop, San Diego, CA, Feb. 2014, and in part at the IEEE International Symposium on Information Theory, Honolulu, HI, July 2014. K. Huang and X. Ma are with the Department of Electronics and Communication Engineering, Sun Yat-sen University, Guangzhou, GD 510006, China (e-mail: [email protected]; [email protected]). K. Huang is also with the Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. D. G. M. Mitchell, L. Wei, and D. J. Costello, Jr. are with the Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA (e-mail: [email protected]; [email protected]; [email protected]). IEEE TRANS. COMMUN. (SUBMITTED PAPER) 2 Index Terms Decoding latency, LDPC block codes, LDPC convolutional codes, protograph-based codes, q-ary LDPC codes, spatially coupled codes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spatially-Coupled LDPC Codes for Transmission over Nonergodic Channels: Recent Advances

This paper resumes our recent advances in the analysis and design of Spatially-Coupled LDPC (SC-LDPC) codes, used for transmission over nonergodic channels, in particular over the block-fading channel and over the block erasure channel. It has been shown that: a) SC-LDPC codes are naturally suitable for nonergodic channel transmission and are robust to packet errors/erasures; b) it is possible ...

متن کامل

Notes: Finite-length Protograph-based Spatially Coupled LDPC Codes

The finite-length performance of multi-edge spatially coupled low-density parity-check (SC-LDPC) codes is analyzed over the binary erasure channel (BEC). Existing scaling laws are extended to arbitrary protograph base matrices including puncturing patterns and multiple edges between nodes. Compared to more involved rate-1/2 structures proposed to improve the threshold to minimum distance trade-...

متن کامل

Modified Log Domain Decoding Algorithm for LDPC Codes over GF ( q )

 Abstract— A modified log domain decoding algorithm of Low density parity check (LDPC) codes over GF(q) using permutation to simplify the parity check equation is presented in this paper which is different from the conventional log domain decoding algorithm of Low Density Parity Check (LDPC) codes over GF(q) [11]. Modified Log domain is mathematically equivalent to the conventional log domain ...

متن کامل

On Multilevel Coding Schemes Based on Non-Binary LDPC Codes

We address the problem of constructing of coding schemes for the channels with high-order modulations. It is known, that non-binary LDPC codes are especially good for such channels and significantly outperform their binary counterparts. Unfortunately, their decoding complexity is still large. In order to reduce the decoding complexity we consider multilevel coding schemes based on non-binary LD...

متن کامل

Monte Carlo Simulations of Innnite Low Density Parity Check Codes over Gf(q)

Binary Low Density Parity Check (LDPC) codes have been shown to have near Shan-non limit performance when decoded using a probabilistic decoding algorithm. The analogous codes deened over nite elds GF(q) of order q > 2 show signiicantly improved performance. We present the results of Monte Carlo simulations of the decoding of innnite LDPC Codes which can be used to obtain good constructions for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 63  شماره 

صفحات  -

تاریخ انتشار 2015